Recursion formulae for hypergeometric functions
نویسندگان
چکیده
منابع مشابه
Recursion Formulae for Hypergeometric Functions
indicates the term corresponding to j = h is to be deleted. If one of the a, = 0 or a negative integer, then (1) always converges, since it terminates. Otherwise it converges for all finite x if P ^ Q and for |a;| < 1 if P = Q + 1. In this case, however, the function can be analytically continued into the cut plane |arg (1 — a;)| < x, and we shall often denote by q+iFq(x) not only the series (1...
متن کاملReduction Formulae for Karlsson–minton Type Hypergeometric Functions
We prove a master theorem for hypergeometric functions of Karlsson–Minton type, stating that a very general multilateral U(n) Karlsson–Minton type hypergeometric series may be reduced to a finite sum. This identity contains the Karlsson–Minton summation formula and many of its known generalizations as special cases, and it also implies several “Bailey-type” identities for U(n) hypergeometric se...
متن کاملRecursion rules for the hypergeometric zeta function
The hypergeometric zeta function is defined in terms of the zeros of the Kummer function M(a, a+b; z). It is established that this function is an entire function of order 1. The classical factorization theorem of Hadamard gives an expression as an infinite product. This provides linear and quadratic recurrences for the hypergeometric zeta function. A family of associated polynomials is characte...
متن کاملSummation Formulae for Noncommutative Hypergeometric Series
Hypergeometric series with noncommutative parameters and argument, in the special case involving square matrices, have recently been studied by a number of researchers including (in alphabetical order) Durán, Duval, Grünbaum, Iliev, Ovsienko, Pacharoni, Tirao, and others. See [3, 6, 8, 9, 10, 11, 12, 16] for some selected papers. The subject of hypergeometric series involving matrices is closel...
متن کاملProduct partitions and recursion formulae
Utilizing a method briefly hinted in the author’s paper written in 1991 jointly with V. C. Harris, we derive here a number of unpublished recursion formulae for a variety of product partition functions which we believe have not been considered before in the literature. These include the functionsp∗(n;k,h) (which stands for the number of product partitions ofn> 1 into k parts of which h are dist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1968
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1968-0226065-8